In optimization problems, some variable subsets may have a joint non-linear or non-monotonical influence on the function value. Therefore, knowledge of variable dependencies may be crucial for effective optimization, and many state-of-the-art optimizers leverage it to improve performance. However, some real-world problem instances may be the subject of noise of various origins. In such a case, variable dependencies relevant to optimization may be hard or impossible to tell using dependency checks sufficient for problems without noise, making highly effective operators, e.g., Partition Crossover (PX), useless. Therefore, we use Statistical Linkage Learning (SLL) to decompose problems with noise and propose a new SLL-dedicated mask construction algorithm. We prove that if the quality of the SLL-based decomposition is sufficiently high, the proposed clustering algorithm yields masks equivalent to PX masks for the noise-free instances. The experiments show that the optimizer using the proposed mechanisms remains equally effective despite the noise level and outperforms state-of-the-art optimizers for the problems with high noise.

Aisasetofweightedlinear combinations of the entries ofX, this problem is often referred to as thematrix sensingproblem.

Neural Information Processing Systems http://nips.cc/

Post-hoc 8] for reject, whereincexp(x, y)= c0. AR -10 (left), CIFAR -100 (middle), and ImageNet (right) inalearningtodefersetting, isallowedtodefertoa "specialist " expert.

One simple deferral rule employs the confidence of the current classifier, e.g., based on the maximum predicted softmax probability.